Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
481	A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-02 14:14:13 Circuit complexity Computational complexity theory ACC0 FO Comparator Sorting network AC TC0 Boolean circuit Theoretical computer science Applied mathematics Complexity classes
482	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
483	UNIVERSITY OF CALIFORNIA, RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE 2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS • There are 10 problems on the test. Each problem is worth 10 points. The ordering o Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-02-09 21:58:07 NP Time complexity P FL FO Turing machine Computational complexity theory Theoretical computer science Applied mathematics Complexity classes
484	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
485	A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2014-06-25 14:31:55 Quantum complexity theory Multiparty communication complexity Communication complexity PP Forcing Circuit complexity Theoretical computer science Applied mathematics Computational complexity theory
486	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
487	Matrix-Vector Multiplication in Sub-Quadratic Time (Some Preprocessing Required) Ryan Williams∗ Abstract We show that any n × n matrix A over any finite semiring can be preprocessed in O(n2+ε ) Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2006-10-02 16:50:12 Matrices Matrix theory Computational complexity theory Digital signal processing Fast Fourier transform Adjacency matrix Matrix multiplication Shortest path problem Semiring Mathematics Algebra Abstract algebra
488	Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-01-14 14:00:36 Cryptographic protocols Finite fields Diffie–Hellman problem Oblivious transfer RSA XTR Decisional Diffie–Hellman assumption Decision Linear assumption Diffie–Hellman key exchange Cryptography Public-key cryptography Computational hardness assumptions
489	Unsupervised Environment Recognition and Modeling using Sound Sensing Arnold Kalmbach, Yogesh Girdhar, and Gregory Dudek Abstract— We discuss the problem of automatically discovering different acoustic regions in the w Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-07-25 19:11:42 Mel-frequency cepstrum Signal processing Latent Dirichlet allocation Statistics Image processing Speech recognition Æ Segmentation Topic model Statistical natural language processing Linguistics Computational linguistics
490	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory

UPDATE